منابع مشابه
Colourful Theorems and Indices of Homomorphism Complexes
We extend the colourful complete bipartite subgraph theorems of [G. Simonyi, G. Tardos, Local chromatic number, Ky Fan’s theorem, and circular colorings, Combinatorica 26 (2006), 587–626] and [G. Simonyi, G. Tardos, Colorful subgraphs of Kneser-like graphs, European J. Combin. 28 (2007), 2188–2200] to more general topological settings. We give examples showing that the hypotheses are indeed mor...
متن کاملComparison theorems on resistance distances and Kirchhoff indices of S, T-isomers
Comparison theorems on resistance distances and Kirchhoff indices of the so-called S& T -isomer graphs are established. Then these results are applied to compare Kirchhoff indices of hexagonal chains, showing that the straight chain is the unique chain with maximum Kirchhoff index, whereas the minimum Kirchhoff index is achieved only when the hexagonal chain is an ‘‘all-kink’’ chain. © 2014 Els...
متن کاملHigh-order open mapping theorems
The well-known finite-dimensional first-order open mapping theorem says that a continuous map with a finite-dimensional target is open at a point if its differential at that point exists and is surjective. An identical result, due to Graves, is true when the target is infinite-dimensional, if “differentiability” is replaced by “strict differentiability.” We prove general theorems in which the l...
متن کاملTheorems and examples on high dimensional model representation
Mathematical models described by multivariable functions f(x ) where x 1⁄4 ðx1;...; xnÞ are investigated. If the model output is influenced mainly by low order combinations of input variables x1;...; xn; an attempt can be made to construct a low order approximation to the model using values of f(x ) only. q 2002 Elsevier Science Ltd. All rights reserved.
متن کاملOn the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitmap index can be very large. To overcome this size problem, specialized compression schemes are used. Even though there are empirical evidences that some of these compression schemes work well, there has not been any sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1966
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1966-0199594-3